The k-Critical 2k-Connected Graphs for k∈{3, 4}
نویسندگان
چکیده
منابع مشابه
K3,k-MINORS IN LARGE 7-CONNECTED GRAPHS
It is shown that for any positive integer k there exists a constant N = N(k) such that every 7-connected graph of order at least N contains K3,k as a minor.
متن کاملOn connected (γ, k)-critical graphs
A graph G is said to be (γ, k)-critical if γ(G−S) < γ(G) for any set S of k vertices and domination number γ. Properties of (γ, k)-critical graphs are studied for k ≥ 3. Ways of constructing a (γ, k)-critical graph from smaller (γ, k)-critical graphs are presented.
متن کاملCharacterizing 2k-critical graphs and n-extendable graphs
Let G be a graph with even order. Let M be a matching in G and x1, x2, . . . , x2r , be the M-unsaturated vertices in G. Then G has a perfect matching if and only if there are r independentM-augmenting paths joining the 2r vertices in pairs. LetG be a graph with a perfect matchingM . It is proved that G is 2k-critical if and only if for any 2k vertices u1, u2, . . . , u2k in G, there are k inde...
متن کاملSome 3-connected 4-edge-critical non-Hamiltonian graphs
Let (G) be the domination number of graph G, thus a graph G is k -edge-critical if (G) 1⁄4 k ; and for every nonadjacent pair of vertices u and v, (Gþ uv) 1⁄4 k 1. In Chapter 16 of the book ‘‘Domination in Graphs— Advanced Topics,’’ D. Sumner cites a conjecture of E. Wojcicka under the form ‘‘3-connected 4-critical graphs are Hamiltonian and perhaps, in general (i.e., for any k 4), (k 1)-connec...
متن کاملMaximal K3's and Hamiltonicity of 4-connected claw-free graphs
Let cl(G) denote the Ryjáček’s closure of a claw-free graph G. In this paper, we prove the following result. Let G be a 4-connected claw-free graph. Assume that G[NG(T )] is cyclically 3-connected if T is a maximal K3 in G which is also maximal in cl(G). Then G is hamiltonian. This result is a common generalization of Kaiser et al.’s theorem [J. Graph Theory 48 (2005), no. 4, 267-276] and Pfend...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2000
ISSN: 0095-8956
DOI: 10.1006/jctb.1999.1929